Measuring Distance between Systems under Bounded Power Excitation
نویسندگان
چکیده
منابع مشابه
Measuring the Distance Between Merge Trees
Merge trees represent the topology of scalar functions. To assess the topological similarity of functions, one can compare their merge trees. To do so, one needs a notion of a distance between merge trees, which we define. We provide examples of using our merge tree distance and compare this new measure to other ways used to characterize topological similarity (bottleneck distance for persisten...
متن کاملOn measuring the distance between histograms
A distance measure between two histograms has applications in feature selection, image indexing and retrieval, pattern classi1cation and clustering, etc. We propose a distance between sets of measurement values as a measure of dissimilarity of two histograms. The proposed measure has the advantage over the traditional distance measures regarding the overlap between two distributions; it takes t...
متن کاملComputing the Quartet Distance Between Evolutionary Trees of Bounded Degree
We present an algorithm for calculating the quartet distance between two evolutionary trees of bounded degree on a common set of n species. The previous best algorithm has running time O(d2n2) when considering trees, where no node is of more than degree d. The algorithm developed herein has running time O(d9n log n)) which makes it the first algorithm for computing the quartet distance between ...
متن کاملMeasuring the Discriminative Power of Rating Systems
Assessing the discriminative power of rating systems is an important question to banks and to regulators. In this article we analyze the Cumulative Accuracy Profile (CAP) and the Receiver Operating Characteristic (ROC) which are both commonly used in practice. We give a test-theoretic interpretation for the concavity of the CAP and the ROC curve and demonstrate how this observation can be used ...
متن کاملMeasuring Similarity between Graphs Based on the Levenshtein Distance
Graph data has been commonly used and widely researched both in academia and industry for many applications. And measuring similarity between graphs (i.e., graph matching) is the essential step for graph searching, pattern recognition and machine vision. At present, the most widely used approach to address the graph matching problem is graph edit distance (GED). However, the computation complex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 2004
ISSN: 0363-0129,1095-7138
DOI: 10.1137/s0363012902410113